منابع مشابه
Communication Complexity
The disjointness problem is one of the most important questions in communication complexity, and lower bounds for disjointness have been used to derive lower bounds for streaming algorithms, data structures, barriers in complexity (algebraization), approaches for circuit lower bounds, proof complexity, game theory. Some sources on this include the survey “The Story of Set Disjointness” by Chatt...
متن کاملCommunication Complexity
The first section starts with the basic definitions following mainly the notations of the book written by E. Kushilevitz and N. Nisan [8]. This whole thesis started from this book and some parts follow the proofs from there but I always tried to simplify and improve them, I even discovered and corrected a false claim. But most of the results are mine, supervised by Zoltán Király. At the beginni...
متن کاملCommunication complexity
In this chapter we survey the theory of two-party communication complexity. This field of theoretical computer science aims at studying the following, seemingly very simple, scenario: There are two players Alice who holds an n-bit string x and Bob who holds an n-bit string y. Their goal is to communicate in order to compute the value of some boolean function f(x, y), while exchanging a number o...
متن کاملCommunication Complexity
When I was asked to write a contribution for this book about something related to my research, I immediately thought of Communication Complexity. This relatively simple but extremely beautiful and important sub-area of Complexity Theory studies the amount of communication needed for several distributed parties to learn something new. We will review the basic communication model and some of the ...
متن کاملSeparating the k-party communication complexity hierarchy: an application of the Zarankiewicz problem
For every positive integer k, we construct an explicit family of functions f : {0, 1}n → {0, 1} which has (k+ 1)-party communication complexity O(k) under every partition of the input bits into k + 1 parts of equal size, and k-party communication complexity Ω ( n k42k ) under every partition of the input bits into k parts. This improves an earlier hierarchy theorem due to V. Grolmusz. Our const...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1986
ISSN: 0304-3975
DOI: 10.1016/0304-3975(86)90087-3